Consistent Partial Model Checking

Dynamic Consistency Checking in Goal-Directed Answer Set Programming

In answer set programming, inconsistencies arise when the constraints placed on a program become unsatisfiable. In this paper, we introduce a technique for dynamic consistency checking for our goal-directed method for computing answer sets, under which only those constraints deemed relevant to the partial answer set are tested, allowing inconsistent knowledgebases to be successfully queried. Ho...

On the consistency, expressiveness, and precision of partial modeling formalisms

Partial transition systems support abstract model checking of complex temporal properties by combining both overand under-approximating abstractions into a single model. Over the years, three families of such modeling formalisms have emerged, represented by (1) Kripke Modal Transition Systems (KMTSs), with restrictions on necessary and possible behaviors; (2) Mixed Transition Systems (MixTSs), ...

Co-integration Relation for Oil Production in Alternative Hypotheses about OPEC Behavior

This study estimates three hypotheses of OPEC behavior: market-sharing, target revenue and competitive model for the period 1980 to 2000 for all OPEC courtiers except Iraq. To examine co-integration relation for oil production, we use ADF test in OLS estimation. Also we use ARDL approach to examine these hypotheses and the long run relationship of them. Results indicate none of three hypotheses...

Model Checking with the Partial Order Reduction

Combining Partial Order Reduction with Bounded Model Checking

Model checking is an efficient technique for verifying properties on reactive systems. Partial-order reduction (POR) and symbolic model checking are two common approaches to deal with the state space explosion problem in model checking. Traditionally, symbolic model checking uses BDDs which can suffer from space blowup. More recently bounded model checking (BMC) using SAT-based procedures has b...

Combining Partial

Partial order based reduction techniques to reduce time and memory in model-checking procedures are becoming quite popular. Partial order reduction techniques exploit the independence of actions. Symmetry based reduction techniques exploit the inherent structure of the system to reduce the state space explored during model checking. We provide an abstract framework for combining partial-order a...